A Criterion for Positive Polynomials
نویسندگان
چکیده
Let F be a homogeneous real polynomial of even degree in any number of variables. We consider the problem of giving explicit conditions on the coefficients so that F is positive definite or positive semi-definite. In this note we produce a necessary condition for positivity and a sufficient condition for non-negativity, in terms of positivity or semi-positivity of a one-variable characteristic polynomial of F . Also, we review another well-known sufficient condition. §1 (1.1) Let F be a homogeneous polynomial of degree d in n variables x1, . . . , xn with coefficients in a field K. We will denote K(n, d) the K-vector space of all such polynomials. Its dimension is N = ( n−1+d d ) . For K = R, the field of real numbers, we shall say that F is positive (resp. non-negative), written F > 0 (resp. F ≥ 0), if F (x) > 0 for all x ∈ R − {0} (resp. F (x) ≥ 0 for all x ∈ R). 1991 Mathematics Subject Classification. 14Pxx, 14Mxx.
منابع مشابه
A numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems
In this paper, two inverse problems of determining an unknown source term in a parabolic equation are considered. First, the unknown source term is estimated in the form of a combination of Chebyshev functions. Then, a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem. For solving the problem, the operational matrices of int...
متن کاملDirect Sum Decomposability of Polynomials and Factorization of Associated Forms
For a homogeneous polynomial with a non-zero discriminant, we interpret direct sum decomposability of the polynomial in terms of factorization properties of the Macaulay inverse system of its Milnor algebra. This leads to an if-and-only-if criterion for direct sum decomposability of such a polynomial, and to an algorithm for computing direct sum decompositions over any field, either of characte...
متن کاملRobust Strictly Positive Real Synthesis for Convex Combination of Sixth-Order Polynomials
For the two sixth-order polynomials a(s) and b(s), Hurwitz stability of their convex combination is necessary and sufficient for the existence of a polynomial c(s) such that c(s)/a(s) and c(s)/b(s) are both strictly positive real. Our reasoning method is constructive, and is insightful and helpful in solving the general robust strictly positive real synthesis problem.
متن کاملAnd Hilbert Polynomials
We show that intersection multiplicities over regular local rings can be computed using Hilbert polynomials of modules over the bigraded rings constructed by Gabber in his proof of Serre's nonnegativity conjecture. As a consequence, we give a simpler proof of a criterion in Kurano and Roberts 7] for intersection multiplicities to be positive. 1. Introduction In 11], Serre introduced a deenition...
متن کاملSpectral Factorization of Nd Polynomials
In this paper recent new approaches to the representation of a positive polynomials as a sum of squares are used in order to compute spectral factorizations of nonnegative multivariable polynomials. In principle this problem is solved due to the positive solution of Hilberts 17th problem by Artin. Unfortunately Artins result is not constructive and the denominator polynomials arising have no sp...
متن کاملAlmost strict total positivity and a class of Hurwitz polynomials
We establish sufficient conditions for a matrix to be almost totally positive, thus extending a result of Craven and Csordas who proved that the corresponding conditions guarantee that a matrix is strictly totally positive. Then we apply our main result in order to obtain a new criteria for a real algebraic polynomial to be a Hurwitz one. The properties of the corresponding “extremal” Hurwitz p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003